Models of Robustness in Scheduling and Temporal Planning Based on Optimisation with Dynamic Controllability Constraints
نویسنده
چکیده
Robustness is vital in some scheduling and temporal planning problems, such as evacuation planning (Even, Pillac, and Hentenryck 2014). However, it is hard to measure robustness directly, so some metrics measuring relative features have been introduced (e.g., Cesta, Oddi, and Smith 1998; Aloulou and Portmann 2003; Wilson et al. 2014), as well as algorithms for finding high-robustness schedules (e.g., Aloulou and Portmann 2003; Policella et al. 2009; Banerjee and Haslum 2011). The goal of my PhD thesis is to explore and compare existing measures that measure robustness or other features related to robustness, try to provide new robustness models and try to get more robust schedules or plans.
منابع مشابه
Optimisation of assembly scheduling in VCIM systems using genetic algorithm
Assembly plays an important role in any production system as it constitutes a significant portion of the lead time and cost of a product. Virtual computer-integrated manufacturing (VCIM) system is a modern production system being conceptually developed to extend the application of traditional computer-integrated manufacturing (CIM) system to global level. Assembly scheduling in VCIM systems is ...
متن کاملModels of Robustness for Temporal Planning and Scheduling with Dynamic Controllability
Temporal uncertainty is a basic feature in many real scheduling and planning problems. How to achieve a robust schedule or plan which can deal with the temporal uncertainty is a useful issue in real problems. Current research on this issue has introduced different robustness measures. Although they all reflect the quality of temporal schedules or plans in different perspectives, the lack of res...
متن کاملA Fast Incremental Dynamic Controllability Algorithm
In most real-world planning and scheduling problems, the plan will contain activities of uncertain duration whose precise timing is observed rather than controlled by the agent. In many cases, in order to satisfy the temporal constraints imposed by the plan, the agent must dynamically adapt the schedule of the plan in response to these uncertain observations. Previous work has introduced a poly...
متن کاملOptimising Bounds in Simple Temporal Networks with Uncertainty under Dynamic Controllability Constraints
Dynamically controllable simple temporal networks with uncertainty (STNU) are widely used to represent temporal plans or schedules with uncertainty and execution flexibility. While the problem of testing an STNU for dynamic controllability is well studied, many use cases – for example, problem relaxation or schedule robustness analysis – require optimising a function over STNU time bounds subje...
متن کاملIntegrated Process Planning and Active Scheduling in a Supply Chain-A Learnable Architecture Approach
Through the lens of supply chain management, integrating process planning decisions and scheduling plans becomes an issue of great challenge and importance. Dealing with the problem paves the way to devising operation schedules with minimum makespan; considering the flexible process sequences, it can be viewed as a fundamental tool for achieving the scheme, too. To deal with this integration, t...
متن کامل